Constraint Reduction for Linear Programs with Many Inequality Constraints

نویسندگان

  • André L. Tits
  • Pierre-Antoine Absil
  • William P. Woessner
چکیده

∗The work of the first and third authors was supported in part by the National Science Foundation under Grants DMI-9813057 and DMI-0422931, and by the US Department of Energy under Grant DEFG0204ER25655. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation or those of the US Department of Energy. The work of the second author was supported in part by Peterhouse, University of Cambridge, through a Microsoft Research Fellowship. Part of this work was done while this author was a Research Fellow with the Belgian National Fund for Scientific Research (Aspirant du F.N.R.S.) at the University of Liège, and while he was a Postdoctoral Associate with the School of Computational Science of Florida State University.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical method for solving optimal control problem of the linear differential systems with inequality constraints

In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...

متن کامل

VOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES

In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...

متن کامل

Fast Graph Laplacian Regularized Kernel Learning via Semidefinite-Quadratic-Linear Programming

Kernel learning is a powerful framework for nonlinear data modeling. Using the kernel trick, a number of problems have been formulated as semidefinite programs (SDPs). These include Maximum Variance Unfolding (MVU) (Weinberger et al., 2004) in nonlinear dimensionality reduction, and Pairwise Constraint Propagation (PCP) (Li et al., 2008) in constrained clustering. Although in theory SDPs can be...

متن کامل

A Linear Matrix Inequality (LMI) Approach to Robust Model Predictive Control (RMPC) Design in Nonlinear Uncertain Systems Subjected to Control Input Constraint

In this paper, a robust model predictive control (MPC) algorithm is addressed for nonlinear uncertain systems in presence of the control input constraint. For achieving this goal, firstly, the additive and polytopic uncertainties are formulated in the nonlinear uncertain systems. Then, the control policy can be demonstrated as a state feedback control law in order to minimize a given cost funct...

متن کامل

Fully fuzzy linear programming with inequality constraints

Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...

متن کامل

On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets

In the paper we prove that any nonconvex quadratic problem over some set K ⊆Rn with additional linear and binary constraints can be rewritten as linear problem over the cone, dual to the cone of K-semidefinite matrices. We show that when K is defined by one quadratic constraint or by one concave quadratic constraint and one linear inequality, then the resulting K-semidefinite problem is actuall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2006